0.04/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.09	% Command    : run_vampire %s %d THM
0.08/0.28	% Computer : n015.cluster.edu
0.08/0.28	% Model    : x86_64 x86_64
0.08/0.28	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.08/0.28	% Memory   : 8042.1875MB
0.08/0.28	% OS       : Linux 3.10.0-693.el7.x86_64
0.08/0.28	% CPULimit   : 1920
0.08/0.28	% WCLimit    : 240
0.08/0.28	% DateTime   : Wed Jul 30 02:58:19 EDT 2025
0.08/0.28	% CPUTime    : 
0.08/0.29	This is a THF_ problem
0.08/0.29	Running higher-order theorem proving
0.08/0.30	Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/tmp/tmp.Zg7B8HFy8s/E---3.1_14520.p -m 16384 -t 240
0.14/0.31	% (14630)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on E---3.1_14520 for (2400ds/27Mi)
0.14/0.31	% (14634)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on E---3.1_14520 for (2400ds/18Mi)
0.14/0.31	% (14628)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_14520 for (2400ds/183Mi)
0.14/0.31	% (14631)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on E---3.1_14520 for (2400ds/2Mi)
0.14/0.31	% (14633)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on E---3.1_14520 for (2400ds/275Mi)
0.14/0.31	% (14632)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on E---3.1_14520 for (2400ds/2Mi)
0.14/0.31	% (14629)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_14520 for (2400ds/4Mi)
0.14/0.31	% (14631)Instruction limit reached!
0.14/0.31	% (14631)------------------------------
0.14/0.31	% (14631)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.14/0.31	% (14631)Termination reason: Unknown
0.14/0.31	% (14631)Termination phase: Property scanning
0.14/0.31	
0.14/0.31	% (14631)Memory used [KB]: 895
0.14/0.31	% (14631)Time elapsed: 0.002 s
0.14/0.31	% (14632)Instruction limit reached!
0.14/0.31	% (14632)------------------------------
0.14/0.31	% (14632)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.14/0.31	% (14632)Termination reason: Unknown
0.14/0.31	% (14632)Termination phase: Saturation
0.14/0.31	
0.14/0.31	% (14632)Memory used [KB]: 895
0.14/0.31	% (14632)Time elapsed: 0.002 s
0.14/0.31	% (14632)Instructions burned: 2 (million)
0.14/0.31	% (14632)------------------------------
0.14/0.31	% (14632)------------------------------
0.14/0.31	% (14631)Instructions burned: 2 (million)
0.14/0.31	% (14631)------------------------------
0.14/0.31	% (14631)------------------------------
0.14/0.31	% (14633)Refutation not found, incomplete strategy
0.14/0.31	% (14633)------------------------------
0.14/0.31	% (14633)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.14/0.31	% (14633)Termination reason: Refutation not found, incomplete strategy
0.14/0.31	
0.14/0.31	
0.14/0.31	% (14633)Memory used [KB]: 5500
0.14/0.31	% (14633)Time elapsed: 0.002 s
0.14/0.31	% (14633)Instructions burned: 2 (million)
0.14/0.31	% (14633)------------------------------
0.14/0.31	% (14633)------------------------------
0.14/0.31	% (14630)First to succeed.
0.14/0.31	% (14629)Instruction limit reached!
0.14/0.31	% (14629)------------------------------
0.14/0.31	% (14629)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.14/0.31	% (14629)Termination reason: Unknown
0.14/0.31	% (14629)Termination phase: Saturation
0.14/0.31	
0.14/0.31	% (14629)Memory used [KB]: 5500
0.14/0.31	% (14629)Time elapsed: 0.004 s
0.14/0.31	% (14629)Instructions burned: 6 (million)
0.14/0.31	% (14629)------------------------------
0.14/0.31	% (14629)------------------------------
0.14/0.31	% (14634)Also succeeded, but the first one will report.
0.14/0.31	% (14628)Also succeeded, but the first one will report.
0.14/0.31	% (14630)Refutation found. Thanks to Tanya!
0.14/0.31	% SZS status Theorem for E---3.1_14520
0.14/0.31	% SZS output start Proof for E---3.1_14520
0.14/0.31	thf(func_def_0, type, epsii: (($i > $i) > $o) > $i > $i).
0.14/0.31	thf(func_def_1, type, if: $o > ($i > $i) > ($i > $i) > $i > $i).
0.14/0.31	thf(func_def_3, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
0.14/0.31	thf(func_def_15, type, sK0: $i > $i).
0.14/0.31	thf(func_def_16, type, sK1: $i > $i).
0.14/0.31	thf(func_def_18, type, ph3: !>[X0: $tType]:(X0)).
0.14/0.31	thf(f65,plain,(
0.14/0.31	  $false),
0.14/0.31	  inference(avatar_sat_refutation,[],[f39,f59,f61,f62,f64])).
0.14/0.31	thf(f64,plain,(
0.14/0.31	  ~spl2_3),
0.14/0.31	  inference(avatar_contradiction_clause,[],[f63])).
0.14/0.31	thf(f63,plain,(
0.14/0.31	  $false | ~spl2_3),
0.14/0.31	  inference(equality_resolution,[],[f46])).
0.14/0.31	thf(f46,plain,(
0.14/0.31	  ( ! [X1 : $i > $i] : ((sK1 != X1)) ) | ~spl2_3),
0.14/0.31	  inference(avatar_component_clause,[],[f45])).
0.14/0.31	thf(f45,plain,(
0.14/0.31	  spl2_3 <=> ! [X1 : $i > $i] : (sK1 != X1)),
0.14/0.31	  introduced(avatar_definition,[new_symbols(naming,[spl2_3])])).
0.14/0.31	thf(f62,plain,(
0.14/0.31	  spl2_1 | spl2_3),
0.14/0.31	  inference(avatar_split_clause,[],[f51,f45,f32])).
0.14/0.31	thf(f32,plain,(
0.14/0.31	  spl2_1 <=> ((epsii @ (= @ sK1)) = sK1)),
0.14/0.31	  introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
0.14/0.31	thf(f51,plain,(
0.14/0.31	  ( ! [X1 : $i > $i] : ((sK1 != X1) | ((epsii @ (= @ sK1)) = sK1)) )),
0.14/0.31	  inference(equality_proxy_clausification,[],[f50])).
0.14/0.31	thf(f50,plain,(
0.14/0.31	  ( ! [X1 : $i > $i] : ((sK1 != X1) | ((sK1 = (epsii @ (= @ sK1))) = $true)) )),
0.14/0.31	  inference(equality_proxy_clausification,[],[f48])).
0.14/0.31	thf(f48,plain,(
0.14/0.31	  ( ! [X1 : $i > $i] : (((sK1 = X1) = $false) | ((sK1 = (epsii @ (= @ sK1))) = $true)) )),
0.14/0.31	  introduced(choice_axiom,[])).
0.14/0.31	thf(f61,plain,(
0.14/0.31	  ~spl2_4),
0.14/0.31	  inference(avatar_contradiction_clause,[],[f60])).
0.14/0.31	thf(f60,plain,(
0.14/0.31	  $false | ~spl2_4),
0.14/0.31	  inference(equality_resolution,[],[f58])).
0.14/0.31	thf(f58,plain,(
0.14/0.31	  ( ! [X1 : $i > $i] : ((sK0 != X1)) ) | ~spl2_4),
0.14/0.31	  inference(avatar_component_clause,[],[f57])).
0.14/0.31	thf(f57,plain,(
0.14/0.31	  spl2_4 <=> ! [X1 : $i > $i] : (sK0 != X1)),
0.14/0.31	  introduced(avatar_definition,[new_symbols(naming,[spl2_4])])).
0.14/0.31	thf(f59,plain,(
0.14/0.31	  spl2_4 | spl2_2),
0.14/0.31	  inference(avatar_split_clause,[],[f55,f36,f57])).
0.14/0.31	thf(f36,plain,(
0.14/0.31	  spl2_2 <=> (sK0 = (epsii @ (= @ sK0)))),
0.14/0.31	  introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
0.14/0.31	thf(f55,plain,(
0.14/0.31	  ( ! [X1 : $i > $i] : ((sK0 = (epsii @ (= @ sK0))) | (sK0 != X1)) )),
0.14/0.31	  inference(equality_proxy_clausification,[],[f54])).
0.14/0.31	thf(f54,plain,(
0.14/0.31	  ( ! [X1 : $i > $i] : (((sK0 = X1) = $false) | (sK0 = (epsii @ (= @ sK0)))) )),
0.14/0.31	  inference(equality_proxy_clausification,[],[f52])).
0.14/0.31	thf(f52,plain,(
0.14/0.31	  ( ! [X1 : $i > $i] : (((sK0 = (epsii @ (= @ sK0))) = $true) | ((sK0 = X1) = $false)) )),
0.14/0.31	  introduced(choice_axiom,[])).
0.14/0.31	thf(f39,plain,(
0.14/0.31	  ~spl2_1 | ~spl2_2),
0.14/0.31	  inference(avatar_split_clause,[],[f30,f36,f32])).
0.14/0.31	thf(f30,plain,(
0.14/0.31	  (sK0 != (epsii @ (= @ sK0))) | ((epsii @ (= @ sK1)) != sK1)),
0.14/0.31	  inference(beta_eta_normalization,[],[f29])).
0.14/0.31	thf(f29,plain,(
0.14/0.31	  ((epsii @ (= @ sK1)) != sK1) | ((epsii @ (^[Y0 : $i > $i]: (sK0 = Y0))) != sK0)),
0.14/0.31	  inference(boolean_simplification,[],[f28])).
0.14/0.31	thf(f28,plain,(
0.14/0.31	  ((epsii @ (= @ sK1)) != sK1) | ((epsii @ (^[Y0 : $i > $i]: ($false | (sK0 = Y0)))) != sK0)),
0.14/0.31	  inference(boolean_simplification,[],[f27])).
0.14/0.31	thf(f27,plain,(
0.14/0.31	  ((epsii @ (= @ sK1)) != sK1) | ((epsii @ (^[Y0 : $i > $i]: (((sK1 = Y0) & $false) | (sK0 = Y0)))) != sK0)),
0.14/0.31	  inference(boolean_simplification,[],[f26])).
0.14/0.31	thf(f26,plain,(
0.14/0.31	  ((epsii @ (= @ sK1)) != sK1) | (sK0 != (epsii @ (^[Y0 : $i > $i]: (((sK1 = Y0) & $false) | ($true & (sK0 = Y0))))))),
0.14/0.31	  inference(beta_eta_normalization,[],[f25])).
0.14/0.31	thf(f25,plain,(
0.14/0.31	  ((epsii @ (^[Y0 : $i > $i]: (sK1 = Y0))) != sK1) | (sK0 != (epsii @ (^[Y0 : $i > $i]: (((sK1 = Y0) & $false) | ($true & (sK0 = Y0))))))),
0.14/0.31	  inference(boolean_simplification,[],[f24])).
0.14/0.31	thf(f24,plain,(
0.14/0.31	  ((epsii @ (^[Y0 : $i > $i]: ((sK1 = Y0) & $true))) != sK1) | (sK0 != (epsii @ (^[Y0 : $i > $i]: (((sK1 = Y0) & $false) | ($true & (sK0 = Y0))))))),
0.14/0.31	  inference(boolean_simplification,[],[f23])).
0.14/0.31	thf(f23,plain,(
0.14/0.31	  (sK0 != (epsii @ (^[Y0 : $i > $i]: (((sK1 = Y0) & $false) | ((~ $false) & (sK0 = Y0)))))) | ((epsii @ (^[Y0 : $i > $i]: ((sK1 = Y0) & $true))) != sK1)),
0.14/0.31	  inference(boolean_simplification,[],[f22])).
0.14/0.31	thf(f22,plain,(
0.14/0.31	  ((epsii @ (^[Y0 : $i > $i]: (((sK1 = Y0) & $true) | $false))) != sK1) | (sK0 != (epsii @ (^[Y0 : $i > $i]: (((sK1 = Y0) & $false) | ((~ $false) & (sK0 = Y0))))))),
0.14/0.31	  inference(boolean_simplification,[],[f21])).
0.14/0.31	thf(f21,plain,(
0.14/0.31	  ((epsii @ (^[Y0 : $i > $i]: (((sK1 = Y0) & $true) | ($false & (sK0 = Y0))))) != sK1) | (sK0 != (epsii @ (^[Y0 : $i > $i]: (((sK1 = Y0) & $false) | ((~ $false) & (sK0 = Y0))))))),
0.14/0.31	  inference(boolean_simplification,[],[f20])).
0.14/0.31	thf(f20,plain,(
0.14/0.31	  ((epsii @ (^[Y0 : $i > $i]: (((sK1 = Y0) & $true) | ((~ $true) & (sK0 = Y0))))) != sK1) | (sK0 != (epsii @ (^[Y0 : $i > $i]: (((sK1 = Y0) & $false) | ((~ $false) & (sK0 = Y0))))))),
0.14/0.31	  inference(beta_eta_normalization,[],[f19])).
0.14/0.31	thf(f19,plain,(
0.14/0.31	  (((^[Y0 : $o]: ((^[Y1 : $i > $i]: ((^[Y2 : $i > $i]: (epsii @ (^[Y3 : $i > $i]: (((Y1 = Y3) & Y0) | ((~ Y0) & (Y2 = Y3)))))))))) @ $true @ sK1 @ sK0) != sK1) | (((^[Y0 : $o]: ((^[Y1 : $i > $i]: ((^[Y2 : $i > $i]: (epsii @ (^[Y3 : $i > $i]: (((Y1 = Y3) & Y0) | ((~ Y0) & (Y2 = Y3)))))))))) @ $false @ sK1 @ sK0) != sK0)),
0.14/0.31	  inference(definition_unfolding,[],[f18,f17,f17])).
0.14/0.31	thf(f17,plain,(
0.14/0.31	  (if = (^[Y0 : $o]: ((^[Y1 : $i > $i]: ((^[Y2 : $i > $i]: (epsii @ (^[Y3 : $i > $i]: (((Y1 = Y3) & Y0) | ((~ Y0) & (Y2 = Y3)))))))))))),
0.14/0.31	  inference(cnf_transformation,[],[f9])).
0.14/0.31	thf(f9,plain,(
0.14/0.31	  (if = (^[Y0 : $o]: ((^[Y1 : $i > $i]: ((^[Y2 : $i > $i]: (epsii @ (^[Y3 : $i > $i]: (((Y1 = Y3) & Y0) | ((~ Y0) & (Y2 = Y3)))))))))))),
0.14/0.31	  inference(fool_elimination,[],[f8])).
0.14/0.31	thf(f8,plain,(
0.14/0.31	  ((^[X0 : $o, X1 : $i > $i, X2 : $i > $i] : (epsii @ (^[X3 : $i > $i] : (((X2 = X3) & ~X0) | (X0 & (X1 = X3)))))) = if)),
0.14/0.31	  inference(rectify,[],[f1])).
0.14/0.31	thf(f1,axiom,(
0.14/0.31	  ((^[X0 : $o, X1 : $i > $i, X2 : $i > $i] : (epsii @ (^[X3 : $i > $i] : (((X2 = X3) & ~X0) | (X0 & (X1 = X3)))))) = if)),
0.14/0.31	  file('/export/starexec/sandbox/tmp/tmp.Zg7B8HFy8s/E---3.1_14520.p',ifd)).
0.14/0.31	thf(f18,plain,(
0.14/0.31	  ((if @ $true @ sK1 @ sK0) != sK1) | ((if @ $false @ sK1 @ sK0) != sK0)),
0.14/0.31	  inference(cnf_transformation,[],[f15])).
0.14/0.31	thf(f15,plain,(
0.14/0.31	  ((if @ $true @ sK1 @ sK0) != sK1) | ((if @ $false @ sK1 @ sK0) != sK0)),
0.14/0.31	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f14])).
0.14/0.31	thf(f14,plain,(
0.14/0.31	  ? [X0 : $i > $i,X1 : $i > $i] : (((if @ $true @ X1 @ X0) != X1) | ((if @ $false @ X1 @ X0) != X0)) => (((if @ $true @ sK1 @ sK0) != sK1) | ((if @ $false @ sK1 @ sK0) != sK0))),
0.14/0.31	  introduced(choice_axiom,[])).
0.14/0.31	thf(f12,plain,(
0.14/0.31	  ? [X0 : $i > $i,X1 : $i > $i] : (((if @ $true @ X1 @ X0) != X1) | ((if @ $false @ X1 @ X0) != X0))),
0.14/0.31	  inference(ennf_transformation,[],[f7])).
0.14/0.31	thf(f7,plain,(
0.14/0.31	  ~! [X0 : $i > $i,X1 : $i > $i] : (((if @ $false @ X1 @ X0) = X0) & ((if @ $true @ X1 @ X0) = X1))),
0.14/0.31	  inference(fool_elimination,[],[f6])).
0.14/0.31	thf(f6,plain,(
0.14/0.31	  ~! [X0 : $i > $i,X1 : $i > $i] : ((X0 = (if @ $false @ X1 @ X0)) & ((if @ $true @ X1 @ X0) = X1))),
0.14/0.31	  inference(rectify,[],[f4])).
0.14/0.31	thf(f4,negated_conjecture,(
0.14/0.31	  ~! [X2 : $i > $i,X1 : $i > $i] : ((X2 = (if @ $false @ X1 @ X2)) & ((if @ $true @ X1 @ X2) = X1))),
0.14/0.31	  inference(negated_conjecture,[],[f3])).
0.14/0.31	thf(f3,conjecture,(
0.14/0.31	  ! [X2 : $i > $i,X1 : $i > $i] : ((X2 = (if @ $false @ X1 @ X2)) & ((if @ $true @ X1 @ X2) = X1))),
0.14/0.31	  file('/export/starexec/sandbox/tmp/tmp.Zg7B8HFy8s/E---3.1_14520.p',conj)).
0.14/0.31	% SZS output end Proof for E---3.1_14520
0.14/0.31	% (14630)------------------------------
0.14/0.31	% (14630)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.14/0.31	% (14630)Termination reason: Refutation
0.14/0.31	
0.14/0.31	% (14630)Memory used [KB]: 5500
0.14/0.31	% (14630)Time elapsed: 0.004 s
0.14/0.31	% (14630)Instructions burned: 3 (million)
0.14/0.31	% (14630)------------------------------
0.14/0.31	% (14630)------------------------------
0.14/0.31	% (14627)Success in time 0.005 s
0.14/0.31	EOF